#include <cstdio>
#include <iostream>
using namespace std;
const int MAXN = 50000;
int n , a , b , c , d , f[ MAXN + 5 ];
int mu[ MAXN + 5 ] , prime[ MAXN + 5 ] , k;
bool vis[ MAXN + 5 ];
void sieve( ) {
mu[ 1 ] = 1;
for( int i = 2 ; i <= MAXN ; i ++ ) {
if( !vis[ i ] ) {
prime[ ++ k ] = i;
mu[ i ] = -1;
}
for( int j = 1 ; j <= k && 1ll * i * prime[ j ] <= MAXN ; j ++ ) {
vis[ i * prime[ j ] ] = 1;
if( i % prime[ j ] == 0 ) break;
mu[ i * prime[ j ] ] = -mu[ i ];
}
}
for( int i = 1 ; i <= MAXN ; i ++ )
f[ i ] = f[ i - 1 ] + mu[ i ];
}
long long solve( int n , int m ) {
int d = min( n , m );
long long Ans = 0;
for( int l = 1 , r ; l <= d ; l = r + 1 ) {
r = min( n / ( n / l ) , m / ( m / l ) );
Ans = Ans + 1ll * ( f[ r ] - f[ l - 1 ] ) * ( n / k / l ) * ( m / k / l );
}
return Ans;
}
long long Get( ) {
return solve( b , d ) - solve( a - 1 , d ) - solve( b , c - 1 ) + solve( a - 1 , c - 1 );
}
signed main( ) {
sieve( );
scanf("%d",&n);
while( n -- ) {
scanf("%d %d %d %d %d",&a,&b,&c,&d,&k);
printf("%lld\n",Get( ));
}
return 0;
}